Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings

Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings

Feel lonely? What about reading books? Book is one of the greatest friends to accompany while in your lonely time. When you have no friends and activities somewhere and sometimes, reading book can be a great choice. This is not only for spending the time, it will increase the knowledge. Of course the b=benefits to take will relate to what kind of book that you are reading. And now, we will conc...

Proceedings of the 6th International Conference on Science and Social Research (CSSR)(Malaysia)

Ettore Majorana: His Scientific and Human Personality

This article reports part of the invited talk delivered by the author at the “International Conference on Majorana Legacy" held at the Department of Physics, University of Catania, Catania, Italy, on 5 and 6 Octorber, 2006: Conference organized for celebrating the 100th anniversary of the birth of the Italian theoretical physicist Ettore Majorana; probably the brightest Italian theoretician of ...

The Health Mobility Is All True Mobility?; Comment on “Regional Incentives and Patient Cross-border Mobility: Evidence From the Italian Experience”

In their study, Brenna and Spandonaro analyzed the mobility into Italian regions. In particular, it analyzes the situation of 5 regions, with very different backgrounds. With this paper, we try to better define the meaning of health mobility and to find its underlying causes. Furthermore, we propose a strategy that could help in controlling mobility flows that currently are the source of health...

Breaking the 2n-barrier for Irredundance: Two lines of attack

The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G), respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It has been an open question whether determining these numbers for a graphG on n vertices admits exact algorithms running in time faster than the trivial Θ(2 · poly(n)) enumeration,...